Enhancing data protection with a distributed storage system based on the redundant residue number system

Abstract Big data becomes the key for ubiquitous computing and intelligence, Distributed Storage Systems (DSS) are widely used in large-scale centers or cloud efficient management. However, on stored likely to be unavailable due hardware failures cyberattacks, e.g. DDoS. Maximum Distance Separable (MDS) codes commonly recovery of faulty storage nodes data. usually involves access multiple nodes, which introduces significant communication overheads DSS. In this paper, a new DSS based Redundant Residue Number System (RRNS) is proposed, where enabled by applying second version Chinese Remainder Theorem (CRT-II). The complexity network traffic proposed protection scheme analyzed theoretically compared with that traditional MDS DSSs. Experimental results show achieves lower encoding complexity, than schemes. Although computation case there no failing its still scenarios frequent updates. addition, additional advantages terms security flexibility.